home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Atari Mega Archive 1
/
Atari Mega Archive - Volume 1.iso
/
program
/
rcs5ap1s.lzh
/
RCSREV.C
< prev
next >
Wrap
C/C++ Source or Header
|
1991-01-30
|
22KB
|
727 lines
/*
* RCS revision number handling
*/
/* Copyright (C) 1982, 1988, 1989 Walter Tichy
Copyright 1990 by Paul Eggert
Distributed under license by the Free Software Foundation, Inc.
This file is part of RCS.
RCS is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.
RCS is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with RCS; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
Report problems and direct all questions to:
rcs-bugs@cs.purdue.edu
*/
/* $Log: rcsrev.c,v $
* Revision 5.2 1991/01/30 14:21:32 apratt
* CI with RCS version 5
*
* Revision 5.1 91/01/29 17:46:00 apratt
* Added HEAD_REV code: now you can freeze a configuration with rcs
*
* Revision 5.0 90/08/22 08:13:43 eggert
* checked in with -k by apratt at 91.01.10.13.15.28.
*
* Revision 5.0 1990/08/22 08:13:43 eggert
* Remove compile-time limits; use malloc instead.
* Ansify and Posixate. Tune.
* Remove possibility of an internal error. Remove lint.
*
* Revision 4.5 89/05/01 15:13:22 narten
* changed copyright header to reflect current distribution rules
*
* Revision 4.4 87/12/18 11:45:22 narten
* more lint cleanups. Also, the NOTREACHED comment is no longer necessary,
* since there's now a return value there with a value. (Guy Harris)
*
* Revision 4.3 87/10/18 10:38:42 narten
* Updating version numbers. Changes relative to version 1.1 actually
* relative to 4.1
*
* Revision 1.3 87/09/24 14:00:37 narten
* Sources now pass through lint (if you ignore printf/sprintf/fprintf
* warnings)
*
* Revision 1.2 87/03/27 14:22:37 jenkins
* Port to suns
*
* Revision 4.1 83/03/25 21:10:45 wft
* Only changed $Header to $Id.
*
* Revision 3.4 82/12/04 13:24:08 wft
* Replaced getdelta() with gettree().
*
* Revision 3.3 82/11/28 21:33:15 wft
* fixed compartial() and compnum() for nil-parameters; fixed nils
* in error messages. Testprogram output shortenend.
*
* Revision 3.2 82/10/18 21:19:47 wft
* renamed compnum->cmpnum, compnumfld->cmpnumfld,
* numericrevno->numricrevno.
*
* Revision 3.1 82/10/11 19:46:09 wft
* changed expandsym() to check for source==nil; returns zero length string
* in that case.
*/
/*
#define REVTEST
*/
/* version REVTEST is for testing the routines that generate a sequence
* of delta numbers needed to regenerate a given delta.
*/
#include "rcsbase.h"
libId(revId, "$Id: rcsrev.c,v 5.2 1991/01/30 14:21:32 apratt Exp $")
static struct hshentry *genbranch P((const struct hshentry*,const char*,unsigned,const char*,const char*,const char*,struct hshentries**));
unsigned
countnumflds(s)
const char *s;
/* Given a pointer s to a dotted number (date or revision number),
* countnumflds returns the number of digitfields in s.
*/
{
register const char *sp;
register unsigned count;
if ((sp=s)==nil) return(0);
if (*sp == '\0') return(0);
count = 1;
do {
if (*sp++ == '.') count++;
} while (*sp);
if (*(--sp) == '.') count--; /*trailing periods don't count*/
return(count);
}
void
getbranchno(revno,branchno)
const char *revno;
struct buf *branchno;
/* Given a non-nil revision number revno, getbranchno copies the number of the branch
* on which revno is into branchno. If revno itself is a branch number,
* it is copied unchanged.
*/
{
register unsigned numflds;
register char *tp;
bufscpy(branchno, revno);
numflds=countnumflds(revno);
if (!(numflds & 1)) {
tp = branchno->string;
while (--numflds)
while (*tp++ != '.')
;
*(tp-1)='\0';
}
}
int cmpnum(num1, num2)
const char *num1, *num2;
/* compares the two dotted numbers num1 and num2 lexicographically
* by field. Individual fields are compared numerically.
* returns <0, 0, >0 if num1<num2, num1==num2, and num1>num2, resp.
* omitted fields are assumed to be higher than the existing ones.
*/
{
register const char *s1, *s2;
register int n1, n2;
s1=num1==nil?"":num1;
s2=num2==nil?"":num2;
do {
n1 = 0;
while (isdigit(*s1))
n1 = n1*10 + (*s1++ - '0');
/* skip '.' */
if (*s1=='.') s1++;
n2 = 0;
while (isdigit(*s2))
n2 = n2*10 + (*s2++ - '0');
/* skip '.' */
if (*s2=='.') s2++;
} while ((n1==n2) && (*s1!='\0') && (*s2!='\0'));
if (((*s1=='\0') && (*s2=='\0')) || (n1!=n2))
return (n1 - n2);
/*now n1==n2 and one of s1 or s2 is shorter*/
/*give precedence to shorter one*/
if (*s1=='\0') return 1;
else return -1;
}
int cmpnumfld(num1, num2, fld)
const char *num1, *num2;
unsigned fld;
/* compares the two dotted numbers at field fld and returns
* num1[fld]-num2[fld]. Assumes that num1 and num2 have at least fld fields.
* fld must be positive.
*/
{
register const char *s1, *s2;
register unsigned n1, n2;
s1 = num1;
s2 = num2;
/* skip fld-1 fields */
for (n1 = fld; (--n1); ) {
while (*s1++ != '.')
;
while (*s2++ != '.')
;
}
/* Now s1 and s2 point to the beginning of the respective fields */
/* compute numerical value and compare */
n1 = 0;
while (isdigit(*s1))
n1 = n1*10 + (*s1++ - '0');
n2 = 0;
while (isdigit(*s2))
n2 = n2*10 + (*s2++ - '0');
return n1<n2 ? -1 : n1==n2 ? 0 : 1;
}
int
compartial(num1, num2, length)
const char *num1, *num2;
unsigned length;
/* compare the first "length" fields of two dot numbers;
the omitted field is considered to be larger than any number */
/* restriction: at least one number has length or more fields */
{
register const char *s1, *s2;
register int n1, n2;
s1 = num1; s2 = num2;
if ( s1==nil || *s1 == '\0' ) return 1;
if ( s2==nil || *s2 == '\0' ) return -1;
for (;;) {
n1 = 0;
while (isdigit(*s1))
n1 = n1*10 + (*s1++ - '0');
if ( *s1 == '.' ) s1++; /* skip . */
n2 = 0;
while (isdigit(*s2))
n2 = n2*10 + (*s2++ - '0');
if (*s2 == '.') s2++;
if ( n1 != n2 ) return n1-n2;
if ( --length == 0 ) return 0;
if ( *s1 == '\0' ) return 1;
if ( *s2 == '\0' ) return -1;
}
}
char * partialno(rev1,rev2,length)
struct buf *rev1;
const char *rev2;
register unsigned length;
/* Function: Copies length fields of revision number rev2 into rev1.
* Return rev1's string.
*/
{
register char *r1;
bufscpy(rev1, rev2);
r1 = rev1->string;
while (length) {
while (*r1!='.' && *r1)
++r1;
++r1;
length--;
}
/* eliminate last '.'*/
*(r1-1)='\0';
return rev1->string;
}
static void
store1(store, next)
struct hshentries ***store;
struct hshentry *next;
/*
* Allocate a new list node that addresses NEXT.
* Append it to the list that **STORE is the end pointer of.
*/
{
register struct hshentries *p;
p = ftalloc(struct hshentries);
p->first = next;
**store = p;
*store = &p->rest;
}
struct hshentry * genrevs(revno,date,author,state,store)
const char *revno, *date, *author, *state;
struct hshentries **store;
/* Function: finds the deltas needed for reconstructing the
* revision given by revno, date, author, and state, and stores pointers
* to these deltas into a list whose starting address is given by store.
* The